Co-deenite Set Constraints
نویسندگان
چکیده
In this paper, we introduce the class of co-deenite set constraints. This is a natural sub-class of set constraints which, when satissable, have a greatest solution. It is practically motivated by the set-based analysis of logic programs with the greatest-model semantics. We present an algorithm solving co-deenite set constraints and show that their satissa-bility problem is DEXPTIME-complete.
منابع مشابه
Logic Programming with Constructor-based Type Constraints
A concept of types and type sorts for logic programming is introduced, where types and type sorts are regarded as constraints. Instead of deening \well-sorted" terms and substitutions, type constraints and type sort constraints are deened. The approach is based on term models. A type is interpreted as a set of object terms and a type sort is interpreted as a set of types. Parameters of types ca...
متن کاملSet constraints with projections are in NEXPTIME
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. In this paper we prove that the problem of existence of a solution of a system of set constraints with projections is in NEX-PTIME, and thus that it is NEXPTIME-complete. This extends the result of A. on decidability of negated set constraints and ...
متن کاملSimilarity and other spectral relations for symmetric cones
A one{to{one relation is established between the nonnegative spectral values of a vector in a primitive symmetric cone and the eigenvalues of its quadratic representation. This result is then exploited to derive similarity relations for vectors with respect to a general symmetric cone. For two positive deenite matrices X and Y , the square of the spectral geometric mean is similar to the matrix...
متن کاملSolving Classes of Set Constraints with Tree Automata
Set constraints is a suitable formalism for static analysis of programs. However, it is known that the complexity of set constraint problems in the most general cases is very high (NEXPTIME-completeness of the satissability test). Lots of works are involved in nding more trac-table subclasses. In this paper, we investigate two classes of set constraints shown to be useful for program analysis: ...
متن کاملState - space solution to the periodic multirate H 1 control problem :
A state-space solution to the H 1 control problem for periodic multirate systems is presented. The solution is based on the lifting method, where an equivalent time-invariant system description is derived for the original periodic multirate problem. The H 1-optimal controller for the multirate system is expressed in terms of two algebraic Riccati equations. The so-called causality constraints a...
متن کامل